Integrating Constraint Solving into Proof Planning
Identifieur interne : 009E78 ( Main/Exploration ); précédent : 009E77; suivant : 009E79Integrating Constraint Solving into Proof Planning
Auteurs : Erica Melis [Allemagne] ; Jürgen Zimmer [Allemagne] ; Tobias Müller [Allemagne]Source :
- Lecture Notes in Computer Science [ 0302-9743 ]
Abstract
Abstract: In proof planning mathematical objects with theory-specific properties have to be constructed. More often than not, mere unification offers little support for this task. However, the integration of constraint solvers into proof planning can sometimes help solving this problem. We present such an integration and discover certain requirements to be met in order to integrate the constraint solver’s efficient activities in a way that is correct and sufficient for proof planning. We explain how the requirements can be met by n extension of the constraint solving technology and describe their implementation in the constraint solver ${\mathcal C}o{\cal SIE}$ .
Url:
DOI: 10.1007/10720084_3
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 000817
- to stream Istex, to step Curation: 000812
- to stream Istex, to step Checkpoint: 002131
- to stream Main, to step Merge: 00A459
- to stream Main, to step Curation: 009E78
Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Integrating Constraint Solving into Proof Planning</title><author><name sortKey="Melis, Erica" sort="Melis, Erica" uniqKey="Melis E" first="Erica" last="Melis">Erica Melis</name></author><author><name sortKey="Zimmer, Jurgen" sort="Zimmer, Jurgen" uniqKey="Zimmer J" first="Jürgen" last="Zimmer">Jürgen Zimmer</name></author><author><name sortKey="Muller, Tobias" sort="Muller, Tobias" uniqKey="Muller T" first="Tobias" last="Müller">Tobias Müller</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:243CA001772E3A51A2FA70FF3F8F7167AFB0F588</idno><date when="2000" year="2000">2000</date><idno type="doi">10.1007/10720084_3</idno><idno type="url">https://api.istex.fr/ark:/67375/HCB-TGBWRZS9-W/fulltext.pdf</idno><idno type="wicri:Area/Istex/Corpus">000817</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">000817</idno><idno type="wicri:Area/Istex/Curation">000812</idno><idno type="wicri:Area/Istex/Checkpoint">002131</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">002131</idno><idno type="wicri:doubleKey">0302-9743:2000:Melis E:integrating:constraint:solving</idno><idno type="wicri:Area/Main/Merge">00A459</idno><idno type="wicri:Area/Main/Curation">009E78</idno><idno type="wicri:Area/Main/Exploration">009E78</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Integrating Constraint Solving into Proof Planning</title><author><name sortKey="Melis, Erica" sort="Melis, Erica" uniqKey="Melis E" first="Erica" last="Melis">Erica Melis</name><affiliation wicri:level="3"><country>Allemagne</country><placeName><settlement type="city">Sarrebruck</settlement><region type="land" nuts="1">Sarre (Land)</region></placeName><wicri:orgArea>Fachbereich Informatik, Universität des Saarlandes, D-66041</wicri:orgArea></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Allemagne</country></affiliation></author><author><name sortKey="Zimmer, Jurgen" sort="Zimmer, Jurgen" uniqKey="Zimmer J" first="Jürgen" last="Zimmer">Jürgen Zimmer</name><affiliation wicri:level="3"><country>Allemagne</country><placeName><settlement type="city">Sarrebruck</settlement><region type="land" nuts="1">Sarre (Land)</region></placeName><wicri:orgArea>Fachbereich Informatik, Universität des Saarlandes, D-66041</wicri:orgArea></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Allemagne</country></affiliation></author><author><name sortKey="Muller, Tobias" sort="Muller, Tobias" uniqKey="Muller T" first="Tobias" last="Müller">Tobias Müller</name><affiliation wicri:level="3"><country>Allemagne</country><placeName><settlement type="city">Sarrebruck</settlement><region type="land" nuts="1">Sarre (Land)</region></placeName><wicri:orgArea>Programming Systems Lab, Universität des Saarlandes, Postfach 15 11 50, D-66041</wicri:orgArea></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Allemagne</country></affiliation></author></analytic><monogr></monogr><series><title level="s" type="main" xml:lang="en">Lecture Notes in Computer Science</title><idno type="ISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="ISSN">0302-9743</idno></series></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: In proof planning mathematical objects with theory-specific properties have to be constructed. More often than not, mere unification offers little support for this task. However, the integration of constraint solvers into proof planning can sometimes help solving this problem. We present such an integration and discover certain requirements to be met in order to integrate the constraint solver’s efficient activities in a way that is correct and sufficient for proof planning. We explain how the requirements can be met by n extension of the constraint solving technology and describe their implementation in the constraint solver ${\mathcal C}o{\cal SIE}$ .</div></front></TEI><affiliations><list><country><li>Allemagne</li></country><region><li>Sarre (Land)</li></region><settlement><li>Sarrebruck</li></settlement></list><tree><country name="Allemagne"><region name="Sarre (Land)"><name sortKey="Melis, Erica" sort="Melis, Erica" uniqKey="Melis E" first="Erica" last="Melis">Erica Melis</name></region><name sortKey="Melis, Erica" sort="Melis, Erica" uniqKey="Melis E" first="Erica" last="Melis">Erica Melis</name><name sortKey="Muller, Tobias" sort="Muller, Tobias" uniqKey="Muller T" first="Tobias" last="Müller">Tobias Müller</name><name sortKey="Muller, Tobias" sort="Muller, Tobias" uniqKey="Muller T" first="Tobias" last="Müller">Tobias Müller</name><name sortKey="Zimmer, Jurgen" sort="Zimmer, Jurgen" uniqKey="Zimmer J" first="Jürgen" last="Zimmer">Jürgen Zimmer</name><name sortKey="Zimmer, Jurgen" sort="Zimmer, Jurgen" uniqKey="Zimmer J" first="Jürgen" last="Zimmer">Jürgen Zimmer</name></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 009E78 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 009E78 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Main
|étape= Exploration
|type= RBID
|clé= ISTEX:243CA001772E3A51A2FA70FF3F8F7167AFB0F588
|texte= Integrating Constraint Solving into Proof Planning
}}
| This area was generated with Dilib version V0.6.33. |  |